Discovering Missing Background Knowledge in Ontology Matching

نویسندگان

  • Fausto Giunchiglia
  • Pavel Shvaiko
  • Mikalai Yatskevich
چکیده

Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that correspond semantically to each other. We present an approach to deal with the lack of background knowledge in matching tasks by using semantic matching iteratively. Unlike previous approaches, where the missing axioms are manually declared before the matching starts, we propose a fully automated solution. The benefits of our approach are: (i) saving some of the pre-match efforts, (ii) improving the quality of match via iterations, and (iii) enabling the future reuse of the newly discovered knowledge. We evaluate the implemented system on large real-world test cases, thus, proving empirically the benefits of our approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A criteria for selecting background knowledge for domain specific semantic matching

Ontology matching is a problem that is rapidly reaching maturity especially in the context of the emergent semantic web. Semantic matching is the detection of specific correspondences between concepts in two ontologies including but not limited to ≡, v and w. Many semantic matching approaches today use some form of background knowledge to aid them in discovering correspondences. This paper pres...

متن کامل

research outputs Overcoming schema heterogeneity between linked

Schema heterogeneity issues often represent an obstacle for discovering coreference links between individuals in semantic data repositories. In this paper we present an approach, which performs ontology schema matching in order to improve instance coreference resolution performance. A novel feature of the approach is its use of existing instancelevel coreference links defined in third-party rep...

متن کامل

outputs Overcoming schema heterogeneity between linked

Schema heterogeneity issues often represent an obstacle for discovering coreference links between individuals in semantic data repositories. In this paper we present an approach, which performs ontology schema matching in order to improve instance coreference resolution performance. A novel feature of the approach is its use of existing instancelevel coreference links defined in third-party rep...

متن کامل

Exploiting the Structure of Background Knowledge Used in Ontology Matching

We investigate the use of a background knowledge ontology in ontology matching. We conducted experiments on matching two medical ontologies using a third extensive one as background knowledge, and compare the results with directly matching the two ontologies. Our results indicate that using background knowledge, in particular the exploitation of its structure, has enormous benefits on the match...

متن کامل

Ontology matching using comprehensive ontology as background knowledge

We investigate the use of background knowledge ontology in ontology matching. We conducted experiments on matching two medical ontologies using third extensive one as background knowledge, and compare it to the direct match. Our results indicate that using background knowledge, in particular exploitation of its structure, has enormous benefit in the matching. The semantics of knowledge within t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006